Information maximization clustering via multi-view self-labelling

نویسندگان

چکیده

Image clustering is a particularly challenging computer vision task, which aims to generate annotations without human supervision. Recent advances focus on the use of self-supervised learning strategies in image clustering, by first valuable semantics and then representations. These multiple-phase algorithms, however, involve several hyper-parameters transformation functions, are computationally intensive. By extending grouping based approach, this work proposes novel single-phase method that simultaneously learns meaningful representations assigns corresponding annotations. This achieved integrating discrete representation into paradigm through classifier net. Specifically, proposed objective employs mutual information maximise dependency integrated probability distribution. The distribution derived means process compares learnt latent with set trainable prototypes. To enhance performance classifier, we jointly apply across multi-crop views. Our empirical results show framework outperforms state-of-the-art techniques an average accuracy 89.1%, 49.0%, 83.1%, 27.9%, respectively, baseline datasets CIFAR-10, CIFAR-100/20, STL10 Tiny-ImageNet/200. Finally, also demonstrates attractive robustness parameter settings, large number classes, making it ready be applicable other datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-view Self-Paced Learning for Clustering

Exploiting the information from multiple views can improve clustering accuracy. However, most existing multi-view clustering algorithms are nonconvex and are thus prone to becoming stuck into bad local minima, especially when there are outliers and missing data. To overcome this problem, we present a new multi-view self-paced learning (MSPL) algorithm for clustering, that learns the multi-view ...

متن کامل

Clustering and Understanding Documents via Discrimination Information Maximization

Text document clustering is a popular task for understanding and summarizing large document collections. Besides the need for efficiency, document clustering methods should produce clusters that are readily understandable as collections of documents relating to particular contexts or topics. Existing clustering methods often ignore term-document semantics while relying upon geometric similarity...

متن کامل

Multi-objective Multi-view Spectral Clustering via Pareto Optimization

Traditionally, spectral clustering is limited to a single objective: finding the normalized min-cut of a single graph. However, many real-world datasets, such as scientific data (fMRI scans of different individuals), social data (different types of connections between people), web data (multi-type data), are generated from multiple heterogeneous sources. How to optimally combine knowledge from ...

متن کامل

Semi-supervised information-maximization clustering

Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization clustering algorithm based on squared-loss mutual information to effectively ...

متن کامل

Partial Multi-View Clustering

Real data are often with multiple modalities or coming from multiple channels, while multi-view clustering provides a natural formulation for generating clusters from such data. Previous studies assumed that each example appears in all views, or at least there is one view containing all examples. In real tasks, however, it is often the case that every view suffers from the missing of some data ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Knowledge Based Systems

سال: 2022

ISSN: ['1872-7409', '0950-7051']

DOI: https://doi.org/10.1016/j.knosys.2022.109042